Random boolean formulas representing any boolean function with asymptotically equal probability
نویسندگان
چکیده
منابع مشابه
Representing Policies for Quantified Boolean Formulas
The practical use of Quantified Boolean Formulas (QBFs) often calls for more than solving the validity problem QBF. For this reason we investigate the corresponding function problems whose expected outputs are policies. QBFs which do not evaluate to true do not have any solution policy, but can be of interest nevertheless; for handling them, we introduce a notion of partial policy. We focus on ...
متن کاملComplexity and Probability of Some Boolean Formulas
For any Boolean function f let L f be its formula size complexity in the basis f g For every n and every k n we describe a probabilistic distribution on formulas in the basis f g in some given set of n variables and of the size at most k k Let pn k f be the probability that the formula chosen from the distribution computes the function f For every function f with L f k where log we have pn k f ...
متن کاملThe Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function
Among their many uses, growth processes (probabilistic amplification), were used for constructing reliable networks from unreliable components, and deriving complexity bounds of various classes of functions. Hence, determining the initial conditions for such processes is an important and challenging problem. In this paper we characterize growth processes by their initial conditions and derive c...
متن کاملFormulas for approximating pseudo-Boolean random variables
We consider {0, 1}n as a sample space with a probability measure on it, thus making pseudo-Boolean functions into random variables. We then derive explicit formulas for approximating a pseudo-Boolean random variable by a linear function if the measure is permutation-invariant, and by a function of degree at most k if the measure is a product measure. These formulas generalize results due to Ham...
متن کاملRepresenting Boolean formulas by using trees of implicants and implicates
A new tree-based representation for propositional formulas is introduced. This representation, the ∆-trees, allows a compact representation for well-formed formulas as well as a number of reduction strategies in order to consider only those occurrences of literals which are relevant for the satisfiability of
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1990
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90223-5